3 J un 2 00 3 Multidimensional Ehrhart Reciprocity 1 Matthias Beck

نویسنده

  • Matthias Beck
چکیده

In [1], the author generalized Ehrhart’s idea ([2]) of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vertices, we use its description as the intersection of halfspaces, which determine the facets of the polytope. Instead of just a single dilation factor, we allow different dilation factors for each of these facets. We proved that, if our polytope is a simplex, the lattice point counts in the interior and closure of such a vector-dilated simplex are quasipolynomials satisfying an Ehrhart-type reciprocity law. This generalizes the classical reciprocity law for rational polytopes ([2], [3]). In the present paper we complete the picture by extending this result to general rational polytopes. As a corollary, we also generalize a reciprocity theorem of Stanley ([4]).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

un 2 00 3 Multidimensional Ehrhart Reciprocity 1

In [1], the author generalized Ehrhart’s idea ([2]) of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vertices, we use its description as the intersection of halfspaces, which determine the facets of the polytope. Instead of just a single dilation factor, we allow different dilation factors for each of these facets. We proved ...

متن کامل

3 0 N ov 2 00 1 Multidimensional Ehrhart Reciprocity 1

In [1], the author generalized Ehrhart’s idea ([2]) of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vertices, we use its description as the intersection of halfspaces, which determine the facets of the polytope. Instead of just a single dilation factor, we allow different dilation factors for each of these facets. We proved ...

متن کامل

un 2 00 3 Counting Lattice Points by means of the Residue Theorem 1

We use the residue theorem to derive an expression for the number of lattice points in a dilated n-dimensional tetrahedron with vertices at lattice points on each coordinate axis and the origin. This expression is known as the Ehrhart polynomial. We show that it is a polynomial in t, where t is the integral dilation parameter. We prove the Ehrhart-Macdonald reciprocity law for these tetrahedra,...

متن کامل

un 2 00 3 A Closer Look at Lattice Points in Rational Simplices 1

We generalize Ehrhart’s idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+ 1 rational vertices, we use its description as the intersection of n+1 halfspaces, which determine the facets of the simplex. Instead of just a single dilation factor, we allow different dilation factors for each of these facets. We g...

متن کامل

Multidimensional Ehrhart Reciprocity 1

In [1], the author generalized Ehrhart’s idea ([2]) of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vertices, we use its description as the intersection of halfspaces, which determine the facets of the polytope. Instead of just a single dilation factor, we allow different dilation factors for each of these facets. We proved ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003